Dynamic Range Reporting in External Memory
نویسنده
چکیده
In this paper we describe a dynamic external memory data structure that supports range reporting queries in three dimensions in O(logB N + k B ) I/O operations, where k is the number of points in the answer and B is the block size. This is the first dynamic data structure that answers three-dimensional range reporting queries in log O(1)
منابع مشابه
Dynamic Data Structures: Orthogonal Range Queries and Update Efficiency
English) We study dynamic data structures for different variants of orthogonal range reporting query problems. In particular, we consider (1) the planar orthogonal 3-sided range reporting problem: given a set of points in the plane, report the points that lie within a given 3-sided rectangle with one unbounded side, (2) the planar orthogonal range maxima reporting problem: given a set of points...
متن کاملExternal Geometric Data Structures
Many modern applications store and process datasets much larger than the main memory of even state-of-the-art high-end machines. Thus massive and dynamically changing datasets often need to be stored in space efficient data structures on external storage devices such as disks, and in such cases the Input/Output (or I/O) communication between internal and external memory can become a major perfo...
متن کاملExternal Memory Three-Sided Range Reporting and Top-k Queries with Sublogarithmic Updates
An external memory data structure is presented for maintaining a dynamic set ofN two-dimensional points under the insertion and deletion of points, and supporting unsorted 3-sided range reporting queries and top-k queries, where top-k queries report the k points with highest y-value within a given x-range. For any constant 0 < ε ≤ 1 2 , a data structure is constructed that supports updates in a...
متن کاملExternal Memory Orthogonal Range Reporting with Fast Updates
In this paper we describe data structures for orthogonal range reporting in external memory that support fast update operations. The query costs either match the query costs of the best previously known data structures or differ by a small multiplicative factor.
متن کاملExternal Memory Geometric Data Structures
Many modern applications store and process datasets much larger than the main memory of even state-of-the-art high-end machines. Thus massive and dynamically changing datasets often need to be stored in space efficient data structures on external storage devices such as disks. In such cases the Input/Output (or I/O) communication between internal and external memory can become a major performan...
متن کامل